A Note on a Combinatorial Interpretation of the e-Coefficients of the Chromatic Symmetric Function
نویسنده
چکیده
Stanley has studied a symmetric function generalization XG of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of XG in terms of elementary symmetric functions has nonnegative coefficients if G is a clawfree incomparability graph. Here we give a combinatorial interpretation of these coefficients by combining Gasharov’s work on the conjecture with Eg̃eciog̃lu and Remmel’s combinatorial interpretation of the inverse Kostka matrix. This gives a new proof of a partial nonnegativity result of Stanley. As an interesting byproduct we derive a previously unnoticed result relating acyclic orientations to P -tableaux.
منابع مشابه
A Note on a Combinatorial Interpretation of thee - Coe cients of the Chromatic Symmetric
Stanley has studied a symmetric function generalization X G of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of X G in terms of elementary symmetric functions has nonnegative coeecients if G is a clawfree incomparabil-ity graph. Here we present a new approach that combines Gasharov's work on the conjecture with E~...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملChromatic Symmetric Functions of Hypertrees
The chromatic symmetric function XH of a hypergraph H is the sum of all monomials corresponding to proper colorings of H. When H is an ordinary graph, it is known that XH is positive in the fundamental quasisymmetric functions FS , but this is not the case for general hypergraphs. We exhibit a class of hypergraphs H — hypertrees with prime-sized edges — for which XH is F -positive, and give an ...
متن کاملThe Chromatic Symmetric Function of Almost Complete Graphs
The chromatic symmetric function of a graph is a symmetric function that generalizes the chromatic polynomial. Its investigation has largely been motivated by the existence of an open problem, the poset-chain conjecture, which is equivalent to the assertion that for certain graphs, the coefficients in the expansion of the chromatic symmetric function in terms of elementary symmetric functions, ...
متن کاملEnumeration of paths and cycles and e-coefficients of incomparability graphs
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in terms of elementary symmetric functions. Analysis of some of the combinatorial implications of this expansion leads to three bijections involving acyclic orienta...
متن کامل